Polynomial equations for matrices over finite fields
نویسندگان
چکیده
منابع مشابه
Solvability of Systems of Two Polynomial Equations over Finite Fields
In this paper we determine the solvability of families of systems of two polynomial equations over finite fields by computing the exact divisibility of the exponential sums associated to the systems. This generalizes a theorem of Carlitz to systems of two equations. Our result gives an upper bound for the Waring number of systems of diagonal equations. Also, as a by-product, we also obtain info...
متن کاملSolving systems of diagonal polynomial equations over finite fields
We present an algorithm to solve a system of diagonal polynomial equations over finite fields when the number of variables is greater than some fixed polynomial of the number of equations whose degree depends only on the degree of the polynomial equations. Our algorithm works in time polynomial in the number of equations and the logarithm of the size of the field, whenever the degree of the pol...
متن کاملFinite iterative methods for solving systems of linear matrix equations over reflexive and anti-reflexive matrices
A matrix $Pintextmd{C}^{ntimes n}$ is called a generalized reflection matrix if $P^{H}=P$ and $P^{2}=I$. An $ntimes n$ complex matrix $A$ is said to be a reflexive (anti-reflexive) matrix with respect to the generalized reflection matrix $P$ if $A=PAP$ ($A=-PAP$). In this paper, we introduce two iterative methods for solving the pair of matrix equations $AXB=C$ and $DXE=F$ over reflexiv...
متن کاملLinearized polynomial maps over finite fields
We consider polynomial maps described by so-called (multivariate) linearized polynomials. These polynomials are defined using a fixed prime power, say q. Linearized polynomials have no mixed terms. Considering invertible polynomial maps without mixed terms over a characteristic zero field, we will only obtain (up to a linear transformation of the variables) triangular maps, which are the most b...
متن کاملOn Sparse Polynomial Interpolation over Finite Fields
We present a Las Vegas algorithm for interpolating a sparse multivariate polynomial over a finite field, represented with a black box. Our algorithm modifies the algorithm of BenOr and Tiwari in 1988 for interpolating polynomials over rings with characteristic zero to characteristic p by doing additional probes. One of the best algorithms for sparse polynomial interpolation over a finite field ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the Australian Mathematical Society
سال: 1999
ISSN: 0004-9727,1755-1633
DOI: 10.1017/s0004972700032603